A Nice Labelling for Tree-Like Event Structures of Degree 3 (Extended Version)
نویسنده
چکیده
We address the problem of finding nice labellings for event structures of degree 3. We develop a minimum theory by which we prove that the index of an event structure of degree 3 is bounded by a linear function of the height. The main theorem of the paper states that event structures of degree 3 whose causality order is a tree have a nice labelling with 3 colors. We exemplify how to use this theorem to construct upper bounds for the index of other event structures of degree 3.
منابع مشابه
A Nice Labelling for Tree-Like Event Structures of Degree 3
We address the problem of finding nice labellings for event structures of degree 3. We develop a minimum theory by which we prove that the labelling number of an event structure of degree 3 is bounded by a linear function of the height. The main theorem we present in this paper states that event structures of degree 3 whose causality order is a tree have a nice labelling with 3 colors. Finally,...
متن کاملFinite Labelling Problem in Event Structures
In event structures, one of the classical models of parallelism, the concept of nice labelling occurs: this consists in attributing label to each event of the structure, in such a way that two different events may have the same label if either they are in temporal causality or they are not the initial occurrences of incompatible actions. The problem is to minimize the number of labels. In this ...
متن کاملCombinatorics from Concurrency: the Nice Labelling Problem for Event Structures∗
An event structures is a mathematical model of a concurrent process. It consists of a set of local events ordered by a causality relation and separated by a conflict relation. A global state, or configuration, is an order ideal whose elements are pairwise not in conflict. Configurations, ordered by subset inclusion, form a poset whose Hasse diagram codes the state-transition graph of the proces...
متن کاملOn the Symmetric Property of Homogeneous Boolean Functions
We use combinatorial methods and permutation groups to classify homogeneous boolean functions. The property of symmetry of a boolean function limits the size of the function’s class. We exhaustively searched for all boolean functions on V6. We found two interesting classes of degree 3 homogeneous boolean functions: the first class is degree 3 homogeneous bent boolean functions; and the second i...
متن کاملNice Labeling Problem for Event Structures: A Counterexample
In this paper, we present a counterexample to a conjecture of Rozoy and Thiagarajan from 1991 (also called the nice labeling problem) asserting that any (coherent) event structure with finite degree admits a labeling with a finite number of labels or, equivalently, that there exists a function f : N → N such that an event structure with degree ≤ n admits a labeling with at most f(n) labels. Our...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/0903.3462 شماره
صفحات -
تاریخ انتشار 2009